Course Generation Based on HTN Planning
نویسنده
چکیده
A course generator automatically assembles learning objects retrieved from one or several repositories to a greater unit. Different frameworks for course generation exists, but only a few allow the representation of sophisticated pedagogical knowledge. In this paper, we describe course generation based on pedagogical tasks and methods, formalized in a hierarchical task network (HTN) planner. We describe the moderate constructivist learning strategy we implemented in this framework, problems that arouse from using HTN planning and their solutions. A first evaluation supports the practical value of our approach.
منابع مشابه
A Personalized Course Generation System Based on Task-centered Instruction Strategy
The Course Generation System (CGS) is a system that generates a course accommodate to the teaching material, student status and learning goal. In this paper we present a framework for authoring/course generation system using ontology and an HTN planning technique called PANDA.TUTOR. This system allows the author to prepare the course structure and content, enriched with classification informati...
متن کاملPedagogically founded courseware generation based on HTN-planning
Course generation enables the automatic assembly of course(ware) adapted to the learner’s competencies and learning goals. It offers a middle way between traditional pre-authored “one-size fits all” courseware and manual resource look-up. Such an assembly requires pedagogical knowledge, represented, for instance, as expert system rules or planning operators. In this article, we describe the cou...
متن کاملUsing Planning Graphs for Solving HTN Planning Problems
In this paper we present the GraphHTN algorithm, a hybrid planning algorithm that does Hierarchical Task-Network (HTN) planning using a combination of HTN-style problem reduction and Graphplan-style planning-graph generation. We also present experimental results comparing GraphHTN with ordinary HTN decomposition (as implemented in the UMCP planner) and ordinary Graphplan search (as implemented ...
متن کاملOn the Decidability of HTN Planning with Task Insertion
The field of deterministic AI planning can roughly be divided into two approaches — classical statebased planning and hierarchical task network (HTN) planning. The plan existence problem of the former is known to be decidable while it has been proved undecidable for the latter. When extending HTN planning by allowing the unrestricted insertion of tasks and ordering constraints, one obtains a fo...
متن کاملEncoding HTN Planning in Propositional Logic
Casting planning problems as propositional satlsfiability problems has recently been shown to be an effective way of scaling up plan synthesis. Until now, the benefits of this approach have only been utUized in primitive action-based planning models. Motivated by the conventional wisdom in the planning community about the effectiveness of hierarchical task network (HTN) planning models, in this...
متن کامل